Subgame Perfect Implementation With Almost Perfect Information
نویسندگان
چکیده
The theory of incomplete contracts has been recently questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of this mechanism to the introduction of small amounts of asymmetric information. Our main result is that the mechanism may not yield (even approximately) truthful revelation as the amount of asymmetric information goes to zero. Aghion: Harvard University, Department of Economics. email: [email protected]. Fudenberg: Harvard University, Department of Economics. email: [email protected]. Holden: Massachusetts Institute of Technology, Sloan School of Management. E52-410, 50 Memorial Drive Cambridge MA 02142. email: [email protected]. We are grateful to Mathias Dewatripont, Bob Gibbons, Oliver Hart, Philippe Jehiel, John Moore, Roger Myerson, Andrew Postlewaite, Jean Tirole, Ivan Werning and Muhamet Yildiz for helpful discussions and comments. Michael Powell provided excellent research assistance.
منابع مشابه
Subgame Perfect Implementation: A Necessary and Almost Sufficient Condition*
We present a necessary and almost sufftcient condition for subgame perfect implementation of social choice correspondences. In societies with at least three individuals, any social choice correspondence which satisfies no veto power and our necessary Condition a is subgame perfect implementable. Thus Condition GL is analogous to monotonicity which, by Maskin’s celebrated characterization, is ne...
متن کاملSubgame Perfect Implementation with Almost Perfect Information and the Hold-Up Problem
The foundations of incomplete contracts have been questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of subgame perfect implementation to the introduction of small amounts of asymmetric information. We show that Moore-Repullo mechanisms may not yield (even approximately) truthful revelation in pure or totally mixed s...
متن کاملSubgame perfect implementation: A full characterization
Moore and Repullo [Subgame perfect implementation, Econometrica 56 (1988) 1191–1220], and Abreu and Sen [Subgame perfect implementation: a necessary and almost sufficient condition, J. Econ. Theory 50 (1990) 285–299] introduce distinct necessary and sufficient conditions for SPE implementation, when the number of players is at least three. This paper closes the gap between the conditions—a comp...
متن کاملSubgame Perfect Implementation under Perfect and Almost Perfect Information: An Empirical Test
In this paper we conduct a laboratory experiment to test the extent to which Moore and Repullo’s subgame perfect implementation mechanism induces truth-telling in practice, both in a setting with perfect information and in a setting where buyers and sellers face a small amount of uncertainty regarding the good’s value. We find that Moore-Repullo mechanisms fail to implement truth-telling in a s...
متن کاملProgramming and Verifying Subgame Perfect Mechanisms
An extension of the WHILE-language is developed for programming game-theoretic mechanisms involving multiple agents. Examples of such mechanisms include auctions, voting procedures, and negotiation protocols. A structured operational semantics is provided in terms of extensive games of almost perfect information. Hoare-style partial correctness assertions are proposed to reason about the correc...
متن کامل